Unique Perfect Phylogeny Is NP-Hard
نویسندگان
چکیده
We answer, in the affirmitive, the following question proposed by Mike Steel as a $100 challenge: “Is the following problem NP hard? Given a ternary phylogenetic X-tree T and a collection Q of quartet subtrees on X, is T the only tree that displays Q?” [25,27]
منابع مشابه
Potential Maximal Clique Algorithms for Perfect Phylogeny Problems
Kloks, Kratsch, and Spinrad showed how treewidth and minimum-fill, NP-hard combinatorial optimization problems related to minimal triangulations, are broken into subproblems by block subgraphs defined by minimal separators. These ideas were expanded on by Bouchitté and Todinca, who used potential maximal cliques to solve these problems using a dynamic programming approach in time polynomial in ...
متن کاملUnique perfect phylogeny is intractable
A phylogeny is a tree capturing evolution and ancestral relationships of a set of taxa (e.g., species). Reconstructing phylogenies from molecular data plays an important role in many areas of contemporary biological research. A phylogeny is perfect if (in rough terms) it correctly captures all input data. Determining if a perfect phylogeny exists was shown to be intractable in 1992 by Mike Stee...
متن کاملHaplotyping with missing data via perfect path phylogenies
Computational methods for inferring haplotype information from genotype data are used in studying the association between genomic variation and medical condition. Recently, Gusfield proposed a haplotype inference method that is based on perfect phylogeny principles. A fundamental problem arises when one tries to apply this approach in the presence of missing genotype data, which is common in pr...
متن کاملPerfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and error-free input instances—these instances can be organized as a genotype matrix whose rows are the genotypes and whose columns are the single nucleotide polymorphisms under consideration. Unfortunately, in the more realistic setti...
متن کاملNP - Completeness for Problems of BoundedWidth :
The parameterized computational complexity of a collection of well-known problems including: Bandwidth, Precedence constrained k-processor scheduling, Longest Common Subsequence, DNA physical mapping (or Intervalizing colored graphs), Perfect phylogeny (or Triangulating colored graphs), Colored cutwidth, and Feasible register assignment is explored. It is shown that these problems are hard for ...
متن کامل